当代人工神经网络（ANN）是经过训练的端到端，共同学习功能和分类器以完成感兴趣的任务。尽管非常有效，但这种范式在组装带注释的特定任务数据集和培训大规模网络方面施加了巨大的成本。我们建议通过引入视觉生物标志物分类的辅助预任务来将特征从下游肺超声任务中学习。我们证明，通过培训模型来预测生物标记标签，可以从超声视频中学习一个内容丰富，简洁和可解释的功能空间。值得注意的是，可以从弱视频尺度监督注释的数据中培训生物标志物功能提取器。这些功能可以由针对各种临床任务的各种下游专家模型（诊断，肺严重程度，S/F比）使用。至关重要的是，特定于任务的专家模型的准确性与直接训练此类目标任务的端到端模型相当，同时训练成本大大降低。

For solving a broad class of nonconvex programming problems on an unbounded constraint set, we provide a self-adaptive step-size strategy that does not include line-search techniques and establishes the convergence of a generic approach under mild assumptions. Specifically, the objective function may not satisfy the convexity condition. Unlike descent line-search algorithms, it does not need a known Lipschitz constant to figure out how big the first step should be. The crucial feature of this process is the steady reduction of the step size until a certain condition is fulfilled. In particular, it can provide a new gradient projection approach to optimization problems with an unbounded constrained set. The correctness of the proposed method is verified by preliminary results from some computational examples. To demonstrate the effectiveness of the proposed technique for large-scale problems, we apply it to some experiments on machine learning, such as supervised feature selection, multi-variable logistic regressions and neural networks for classification.

本文介绍了一位深钢筋学习代理（AI），它使用声音作为IEEE COG 2022的DareFightingings竞赛中Darefightingings平台上的输入。尽管最新的AI主要依赖于其环境提供的视觉或结构化观察结果，但学会从Sound玩游戏仍然是新的，因此具有挑战性。我们建议使用不同的方法来处理音频数据，并为盲人AI使用近端策略优化算法。我们还建议利用盲人AI评估提交竞争的声音设计，并为此任务定义两个指标。实验结果不仅显示了我们的盲人AI，而且还提出了两个指标的有效性。

本文旨在研究入侵攻击，然后为区块链网络开发新的网络攻击检测框架。具体来说，我们首先在实验室设计和实施区块链网络。该区块链网络将实现两个目的，即为我们的学习模型生成真实的流量数据（包括正常数据和攻击数据），并实施实时实验，以评估我们建议的入侵检测框架的性能。据我们所知，这是第一个在区块链网络中用于网络攻击的实验室中合成的数据集。然后，我们提出了一个新颖的协作学习模型，该模型允许区块链网络中的有效部署来检测攻击。提出的学习模型的主要思想是使区块链节点能够积极收集数据，从其数据中分享知识，然后与网络中的其他区块链节点交换知识。这样，我们不仅可以利用网络中所有节点的知识，而且还不需要收集所有原始数据进行培训，以便在常规的集中学习解决方案等集中式节点上进行培训。这样的框架还可以避免暴露本地数据的隐私以及过多的网络开销/拥堵的风险。密集模拟和实时实验都清楚地表明，我们提出的基于协作的入侵检测框架可以在检测攻击方面达到高达97.7％的准确性。

近年来对目标细分研究有了很大的进步。除了通用物体外，水生动物也引起了研究的关注。基于深度学习的方法广泛用于水生动物细分，并取得了有希望的表现。但是，缺乏基准测试的具有挑战性的数据集。因此，我们创建了一个被称为“水生动物物种”的新数据集。此外，我们设计了一种新的基于多模式的场景感知分段框架，其利用多个视图分段模型的优点，以有效地分段为水生动物的图像。为了提高培训表现，我们开发了一个引导的混合增强方法。广泛的实验比较了具有最先进的实例分段方法的提出框架的性能，证明了我们的方法是有效的，并且它显着优于现有方法。

深度学习（DL），尤其是深神经网络（DNN），默认情况下纯粹是数据驱动的，通常不需要物理。这是DL的优势，但在应用于科学和工程问题时，它的主要局限性之一就是必不可少的物理特性和所需的准确性。其原始形式的DL方法也无法尊重基本的数学模型或即使在大数据制度中也可以达到所需的准确性。但是，许多数据驱动的科学和工程问题（例如反问题）通常具有有限的实验或观察数据，而在这种情况下，DL会过分拟合数据。我们认为，利用基础数学模型中编码的信息，不仅可以补偿低数据制度中缺少的信息，而且还提供了将DL方法与基础物理学配备的机会，从而促进了更好的概括。本文开发了一种模型受限的深度学习方法及其变体TNET，该方法能够学习隐藏在培训数据和基础数学模型中的信息，以解决由部分微分方程控制的反问题。我们为提出的方法提供了构造和一些理论结果。我们表明，数据随机化可以增强网络的平滑度及其概括。全面的数值结果不仅确认了理论发现，而且还表明，即使仅20个训练数据样本，一维卷积的训练数据样本，50次反向2D热电导率问题，100和50对于时间依赖的2D汉堡方程和逆初始条件和50 2D Navier-Stokes方程。 TNET溶液可以像Tikhonov溶液一样准确，同时几个数量级。由于模型受限项，复制和随机化，这可能是可能的。

本文推动了在图像中分解伪装区域的信封，成了有意义的组件，即伪装的实例。为了促进伪装实例分割的新任务，我们将在数量和多样性方面引入DataSet被称为Camo ++，该数据集被称为Camo ++。新数据集基本上增加了具有分层像素 - 明智的地面真理的图像的数量。我们还为伪装实例分割任务提供了一个基准套件。特别是，我们在各种场景中对新构造的凸轮++数据集进行了广泛的评估。我们还提出了一种伪装融合学习（CFL）伪装实例分割框架，以进一步提高最先进的方法的性能。数据集，模型，评估套件和基准测试将在我们的项目页面上公开提供：https://sites.google.com/view/ltnghia/research/camo_plus_plus

In this paper, we propose a novel technique, namely INVALIDATOR, to automatically assess the correctness of APR-generated patches via semantic and syntactic reasoning. INVALIDATOR reasons about program semantic via program invariants while it also captures program syntax via language semantic learned from large code corpus using the pre-trained language model. Given a buggy program and the developer-patched program, INVALIDATOR infers likely invariants on both programs. Then, INVALIDATOR determines that a APR-generated patch overfits if: (1) it violates correct specifications or (2) maintains errors behaviors of the original buggy program. In case our approach fails to determine an overfitting patch based on invariants, INVALIDATOR utilizes a trained model from labeled patches to assess patch correctness based on program syntax. The benefit of INVALIDATOR is three-fold. First, INVALIDATOR is able to leverage both semantic and syntactic reasoning to enhance its discriminant capability. Second, INVALIDATOR does not require new test cases to be generated but instead only relies on the current test suite and uses invariant inference to generalize the behaviors of a program. Third, INVALIDATOR is fully automated. We have conducted our experiments on a dataset of 885 patches generated on real-world programs in Defects4J. Experiment results show that INVALIDATOR correctly classified 79% overfitting patches, accounting for 23% more overfitting patches being detected by the best baseline. INVALIDATOR also substantially outperforms the best baselines by 14% and 19% in terms of Accuracy and F-Measure, respectively.

In this paper we explore the task of modeling (semi) structured object sequences; in particular we focus our attention on the problem of developing a structure-aware input representation for such sequences. In such sequences, we assume that each structured object is represented by a set of key-value pairs which encode the attributes of the structured object. Given a universe of keys, a sequence of structured objects can then be viewed as an evolution of the values for each key, over time. We encode and construct a sequential representation using the values for a particular key (Temporal Value Modeling - TVM) and then self-attend over the set of key-conditioned value sequences to a create a representation of the structured object sequence (Key Aggregation - KA). We pre-train and fine-tune the two components independently and present an innovative training schedule that interleaves the training of both modules with shared attention heads. We find that this iterative two part-training results in better performance than a unified network with hierarchical encoding as well as over, other methods that use a {\em record-view} representation of the sequence \cite{de2021transformers4rec} or a simple {\em flattened} representation of the sequence. We conduct experiments using real-world data to demonstrate the advantage of interleaving TVM-KA on multiple tasks and detailed ablation studies motivating our modeling choices. We find that our approach performs better than flattening sequence objects and also allows us to operate on significantly larger sequences than existing methods.

Optical coherence tomography (OCT) captures cross-sectional data and is used for the screening, monitoring, and treatment planning of retinal diseases. Technological developments to increase the speed of acquisition often results in systems with a narrower spectral bandwidth, and hence a lower axial resolution. Traditionally, image-processing-based techniques have been utilized to reconstruct subsampled OCT data and more recently, deep-learning-based methods have been explored. In this study, we simulate reduced axial scan (A-scan) resolution by Gaussian windowing in the spectral domain and investigate the use of a learning-based approach for image feature reconstruction. In anticipation of the reduced resolution that accompanies wide-field OCT systems, we build upon super-resolution techniques to explore methods to better aid clinicians in their decision-making to improve patient outcomes, by reconstructing lost features using a pixel-to-pixel approach with an altered super-resolution generative adversarial network (SRGAN) architecture.